Bibliometric evaluation of individual researchers: not even right... not even wrong!
نویسندگان
چکیده
منابع مشابه
Not even wrong: The "it's just X" fallacy.
I applaud Firestone & Scholl (F&S) in calling for more rigor. But, although F&S are correct that some published work on top-down effects suffers from confounds, their sweeping claim that there are no top-down effects on perception is premised on incorrect assumptions. F&S's thesis is wrong. Perception is richly and interestingly influenced by cognition.
متن کاملEven faster sorting of (not only) integers
In this paper we introduce RADULS2, the fastest parallel sorter based on radix algorithm. It is optimized to process huge amounts of data making use of modern multicore CPUs. The main novelties include: extremely optimized algorithm for handling tiny arrays (up to about a hundred of records) that could appear even billions times as subproblems to handle and improved processing of larger subarra...
متن کاملEven Accelerating Machines are Not Universal
We draw an analogy between Godel's Incompleteness Theorem in mathematics, and the impossibility of achieving a Universal Computer in computer science. Speci cally, Godel proved that there exist formal systems of mathematics that are consistent but not complete. In the same way, we show that there does not exist a general-purpose computer that is universal in the sense of being able to simulat...
متن کاملSOS Is Not Obviously Automatizable, Even Approximately
Suppose we want to minimize a polynomial p(x) = p(x1, . . . , xn), subject to some polynomial constraints q1(x), . . . , qm(x) ≥ 0, using the Sum-of-Squares (SOS) SDP hierarachy. Assume we are in the “explicitly bounded” (“Archimedean”) case where the constraints include xi ≤ 1 for all 1 ≤ i ≤ n. It is often stated that the degree-d version of the SOS hierarchy can be solved, to high accuracy, ...
متن کاملSome properties are not even partially testable
For a property P and a sub-property P , we say that P is P -partially testable with q queries if there exists an algorithm that distinguishes, with high probability, inputs in P ′ from inputs ǫ-far from P by using q queries. There are natural properties that require many queries to test, but can be partitioned into a small number of subsets for which they are partially testable with very few qu...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Europhysics News
سال: 2009
ISSN: 0531-7479,1432-1092
DOI: 10.1051/epn/2009704